data permutation

data permutation
数据排列

English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Data Encryption Standard — The Feistel function (F function) of DES General Designers IBM First publis …   Wikipedia

  • Data encryption standard — Pour les articles homonymes, voir DES. DES (Data Encryption Standard) …   Wikipédia en Français

  • Data Encryption Standard — DES Eine Feistel Runde (F Funktion) Entwickler IBM Veröffentlicht 1975 Abgeleitet von …   Deutsch Wikipedia

  • Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… …   Wikipedia

  • Permutation group — In mathematics, a permutation group is a group G whose elements are permutations of a given set M , and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself); the… …   Wikipedia

  • Data Encryption Algorithm — DES Eine Feistel Runde (F Funktion) Entwickler IBM Veröffentlicht 1975 Abgeleitet von Lucifer …   Deutsch Wikipedia

  • Data Encryption Standard — Pour les articles homonymes, voir DES. DES (Data Encryption Standard) fonction F de DES …   Wikipédia en Français

  • Permutation box — In cryptography, a permutation box (or P box) is a method of bit shuffling used to permute or transpose bits across S boxes inputs, retaining diffusion while transposing.[1] In block ciphers, the S boxes and P Boxes are used to make the relation… …   Wikipedia

  • Random permutation statistics — The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example,… …   Wikipedia

  • Primitive permutation group — In mathematics, a permutation group G acting on a set X is called primitive if G preserves no nontrivial partition of X . In the other case, G is imprimitive. An imprimitive permutation group is an example of an induced representation; examples… …   Wikipedia

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”